Analysing R-Tree Variants as Solutions for IP-Lookup
نویسندگان
چکیده
We scrutinise the evolution of classic R-trees, particularly of the PR-tree, which is the first R-tree variant to answer range-queries in worst-case optimal runtime performance. Moreover we analyse the query dependencies of classic R-tree variants and how bulk-loading can be utilised to increase the chance of a more efficient query time. We elaborate on the influence of different input arrangements on the query runtime of the PR-tree and do an in-depth exploration of whether the PR-tree may be used in IP-lookup Problems.
منابع مشابه
A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملBidirectional Pipelining for Scalable IP Lookup and Packet Classification
Both IP lookup and packet classification in IP routers can be implemented by some form of tree traversal. SRAM-based Pipelining can improve the throughput dramatically. However, previous pipelining schemes result in unbalanced memory allocation over the pipeline stages. This has been identified as a major challenge for scalable pipelined solutions. This paper proposes a flexible bidirectional l...
متن کاملAn efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more ex...
متن کاملIP Lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates
Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e...
متن کامل